File Replication Method Based on Demand Forecasting of File Download in P2P Networks

نویسندگان

  • Mamoru Kobayashi
  • Jun Kageyama
  • Susumu Shibusawa
  • Tatsuhiro Yonekura
چکیده

AbstrAct: In peer-to-peer (P2P) networks that support file-sharing services, the level of access demand can vary widely between different files. Since fewer nodes store files for which there is a lower demand, these files are more likely to be lost from the P2P networks if users leave the network or delete the files. File loss can cause users to seek alternatives to P2P services, and lead to degradation in service quality. We propose and evaluate a replication method based on demand forecasting that aims to prevent the loss of low-demand files. In this method, the number of file replicas to be placed is determined based on the forecast demand for the file, so that the loss of low-demand files is likely prevented by placing replicas at nodes that frequently use P2P services. Based on simulation results, we compared our proposed method with basic replication methods in terms of the number of files and the amount of storage used. Our experimental results show that the proposed method prevents file loss by preserving low-demand files over extended periods of time. We also confirmed that the node storage resources consumed by this method are efficiently used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

P2P Network Trust Management Survey

Peer-to-peer applications (P2P) are no longer limited to home users, and start being accepted in academic and corporate environments. While file sharing and instant messaging applications are the most traditional examples, they are no longer the only ones benefiting from the potential advantages of P2P networks. For example, network file storage, data transmission, distributed computing, and co...

متن کامل

Popularity-Based Replication Strategy in Unstructured P2P File Sharing Systems

Peer-to-Peer (P2P) networks have shown to be an efficient and successful mechanism for file sharing over the internet. The unstructured P2P systems usually use a blind search method to find the requested data object. Observations have shown that a few of peers share most of data. In order to increase the success rate of blind search and data availability and load balancing, replication techniqu...

متن کامل

Adaptive File Replication Algorithm for Wireless Mesh Networks

Popular files could exhaust the capacity of the file owner node, leading to low efficiency in P2P file sharing systems. File replication is an effective method to deal with this problem by distributing load over replica nodes. Recently, numerous file replication methods have been proposed for P2P content delivery networks on the Internet. However, due to mobility and resource constraints in the...

متن کامل

On the expected file download time of the random time-based switching algorithm in P2P networks

The expected file download time of the random time-based switching algorithm for peer selection and file downloading in a peer-to-peer (P2P) network is still unknown. The main contribution of this paper is to analyze the expected file download time of the time-based switching algorithm for file sharing in P2P networks when the service capacity of a source peer is totally correlated over time, n...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JDIM

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2010